منابع مشابه
#513 - Fallout From the Peaceful Atom
It was 1953 --seven years after Hiroshima --when President Dwight Eisenhower announced plans for the "peaceful atom" so that "the miraculous inventiveness of man shall not be dedicated to his death, but consecrated to his life."[1,pg.148] The shining star of this program was to be thousands of nuclear-powered electricity-generating plants, worldwide, making electricity "too cheap to meter."[1,p...
متن کاملFrom Copenhagen to neo-Copenhagen interpretation
Positive and negative features of the Copenhagen interpretation are discussed. As positive features can be mentioned its pragmatism and its awareness of the crucial role of measurement. However, the main part of the contribution is devoted to the negative features, to wit, its pragmatism (once again), its confounding of preparation and measurement, its classical account of measurement, its comp...
متن کاملOn the 3-kings and 4-kings in multipartite tournaments
Koh and Tan gave a sufficient condition for a 3-partite tournament to have at least one 3-king in [K.M. Koh, B.P. Tan, Kings in multipartite tournaments, Discrete Math. 147 (1995) 171–183, Theorem 2]. In Theorem 1 of this paper, we extend this result to n-partite tournaments, where n 3. In [K.M. Koh, B.P. Tan, Number of 4-kings in bipartite tournaments with no 3-kings, Discrete Math. 154 (1996)...
متن کاملThe Complexity of Kings
A king in a directed graph is a node from which each node in the graph can be reached via paths of length at most two. There is a broad literature on tournaments (completely oriented digraphs), and it has been known for more than half a century that all tournaments have at least one king [Lan53]. Recently, kings have proven useful in theoretical computer science, in particular in the study of t...
متن کاملThe Problem of the Kings
On a 2m 2n chessboard, the maximum number of nonattacking kings that can be placed is mn, since each 22 cell can have at most one king. Let f m (n) denote the number of ways that mn nonattacking kings can be placed on a 2m 2n chessboard. The purpose of this paper is to prove the following result. such that f m (n) = (c m n + d m)(m + 1) n + O(n m) (n ! 1): For every such placement of kings, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fund og Forskning i Det Kongelige Biblioteks Samlinger
سال: 1990
ISSN: 2246-6061,0069-9896
DOI: 10.7146/fof.v29i1.40939